CMSC 754 Computational Geometry1
نویسنده
چکیده
1Copyright, David M. Mount, 2005, Dept. of Computer Science, University of Maryland, College Park, MD, 20742. These lecture notes were prepared by David Mount for the course CMSC 754, Computational Geometry, at the University of Maryland. Permission to use, copy, modify, and distribute these notes for educational purposes and without fee is hereby granted, provided that this copyright notice appear in all copies.
منابع مشابه
CMSC 754 Computational Geometry
1Copyright, David M. Mount, 2010, Dept. of Computer Science, University of Maryland, College Park, MD, 20742. These lecture notes were prepared by David Mount for the course CMSC 754, Computational Geometry, at the University of Maryland. Permission to use, copy, modify, and distribute these notes for educational purposes and without fee is hereby granted, provided that this copyright notice ap...
متن کاملInterval Arithmetic Yields Efficient Dynamic Filters for Computational Geometry1
We discuss floating-point filters as a means of restricting the precision needed for arithmetic operations while still computing the exact result. We show that interval techniques can be used to speed up the exact evaluation of geometric predicates and describe an efficient implementation of interval arithmetic that is strongly influenced by the rounding modes of the widely used IEEE 754 standa...
متن کاملCmsc 754:spring 2012
Problem 1. As mentioned in class, the convex hull is a somewhat non-robust shape descriptor, since if there are any distant outlying points, they will tend to dominate the shape of the hull. A more robust method is based on the following iterative approach. Given a planar point set P in general position (see Fig. 1(a)), let H1 be the convex hull of P . Remove the vertices of H1 from P and compu...
متن کاملCMSC 451 Dave Mount CMSC 451 : Lecture 17 Extensions of Network Flow Thursday , Nov 9 , 2017
Extensions of Network Flow: Network flow is an important problem because it is useful in a wide variety of applications. We will discuss two useful extensions to the network flow problem. We will show that these problems can be reduced to network flow, and thus a single algorithm can be used to solve both of them. Many computational problems that would seem to have little to do with flow of flu...
متن کاملCMSC 425 Dave Mount CMSC 425 : Lecture 16 Artificial Intelligence for Games :
What is Artificial Intelligence? Artificial intelligence (AI) can be defined (circularly) as “the study of computational systems that exhibit intelligence.” Unfortunately, it is not easy to define what we mean by “intelligence.” In the context of games, an in particular in the design of non-player characters (NPCs) a working definition might be, “It is whatever a person would do.” (Where, of co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012